Searching Real-Valued Synaptic Weights of Hopfield's Associative Memory Using Evolutionary Programming
نویسندگان
چکیده
We apply evolutionary computations to Hop eld model of associative memory. Although there have been a lot of researches which apply evolutionary techniques to layered neural networks, their applications to Hop eld neural networks remain few so far. Previously we reported that a genetic algorithm using discrete encoding chromosomes evolves the Hebb-rule associative memory to enhance its storage capacity. We also reported that the genetic algorithm evolves a network with random synaptic weights eventually to store some number of patterns as xed points. In this paper we present an evolution of the Hop eld model of associative memory using evolutionary programming as a real-valued parameter optimization.
منابع مشابه
Random Perturbations to Hebbian Synapses of Associative Memory Using a Genetic Algorithm
We apply evolutionary algorithms to Hop eld model of associative memory. Previously we reported that a genetic algorithm using ternary chromosomes evolves the Hebb-rule associative memory to enhance its storage capacity by pruning some connections. This paper describes a genetic algorithm using real-encoded chromosomes which successfully evolves over-loaded Hebbian synaptic weights to function ...
متن کاملWhat does the Landscape of a Hopfield Associative Memory Look Like?
We apply evolutionary computations to the Hop eld's neural network model of associative memory. In the model, some of the appropriate con gurations of synaptic weights give the network a function of associative memory. One of our goals is to obtain the distribution of these con gurations in the synaptic weight space. In other words, our aim is to learn a geometry of a tness landscape de ned on ...
متن کاملHow Real-valued Random Synapses Evolve Toward Symmetry with Diploid Chromosomes?
We apply genetic algorithms to the Hop eld's neural network model of associative memory. Previously, we observed that random synaptic weights of a network evolved to create the xed point attractors in pattern space exactly at the locations corresponding to a set of given patterns to be stored. In that simulation, a weight con guration was represented as a sequence of genes which might be called...
متن کاملHop eld Model of Associative Memory as a Test Function of Evolutionary Computations
We apply genetic algorithms to Hop eld's neural network model of associative memory. Previously, using ternary chromosomes, we successfully evolved both random weight matrix and over-loaded Hebbian weight matrix to function as an associative memory. In this paper, we present a real-encoded genetic algorithm to evolve random synaptic weights to store some number of patterns as associative memory...
متن کاملEvolved Asymmetry and Dilution of Random Synaptic Weights in Hop eld Network Turn a Spin-glass Phase into Associative Memory
We apply evolutionary computations to Hop eld's neural network model of associative memory. Previously, we reported that a genetic algorithm can enlarge the Hebb rule associative memory by pruning some of over-loaded Hebbian synaptic weights. In this paper, we present the genetic algorithm also evolves random synaptic weights to store some number of patterns.
متن کامل